A second-order pruning step for verified global optimization
نویسنده
چکیده
We consider pruning steps used in a branch-and-bound algorithm for veri ed global optimization. A rst-order pruning step was given by Ratz using automatic computation of a rst-order slope tuple [21, 22]. In this paper, we introduce a second-order pruning step which is based on automatic computation of a second-order slope tuple. We add this second-order pruning step to the algorithm of Ratz. Furthermore, we compare the new algorithm with the algorithm of Ratz by considering some test problems for veri ed global optimization on a oating-point computer.
منابع مشابه
An Interval Branch-and-Bound Algorithm for Global Optimization using Pruning Steps
We present a new method for computing verified enclosures for the global minimum value and all global minimum points of univariate functions subject to bound constrains. The method works within the branch and bound framework and incorporates inner and outer pruning steps by using first order information of the objective function by means of an interval evaluation of the derivative over the curr...
متن کاملDesign space pruning heuristics and global optimization method for conceptual design of low-thrust asteroid tour missions
Electric propulsion has recently become a viable technology for spacecraft, enabling shorter flight times, fewer required planetary gravity assists, larger payload masses, and/or smaller launch vehicles. With the maturation of this technology, however, comes a new set of challenges in the area of trajectory design. In 2006, the 2 Global Trajectory Optimization Competition (GTOC2) posed a diffic...
متن کاملAas 07-348 Design Space Pruning Techniques for Low-thrust, Multiple Asteroid Rendezvous Trajectory Design
In 2006, the 2 Global Trajectory Optimization Competition (GTOC2) posed a “Grand Asteroid Tour” trajectory optimization problem, where participants were required to find the best possible low-thrust trajectory that would rendezvous with one asteroid from each of four defined groups. As a first step, most teams employed some form of design space pruning, in order to reduce the overall number of ...
متن کاملOptimal centers in branch-and-prune algorithms for univariate global optimization
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound constraints. The algorithm works within the branch-and-bound framework and uses first order information of the objective function. In this context, we investigate valuable properties of the optimal center of a mean value fo...
متن کاملComplexity Analysis and Efficient Measurement Selection Primitives for High-Rate Graph SLAM
Sparsity has been widely recognized as crucial for efficient optimization in graph-based SLAM. Because the sparsity and structure of the SLAM graph reflect the set of incorporated measurements, many methods for sparsification have been proposed in hopes of reducing computation. These methods often focus narrowly on reducing edge count without regard for structure at a global level. Such structu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Global Optimization
دوره 44 شماره
صفحات -
تاریخ انتشار 2009